Search Results

Documents authored by de Meer, Hermann

Document
DOI: 10.4230/OASIcs.KiVS.2011.157
An Arbitrary 2D Structured Replica Control Protocol

Authors: Robert Basmadjian and Hermann de Meer

Published in: OASIcs, Volume 17, 17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011)

Abstract
Traditional replication protocols that logically arrange the replicas into a specific structure have reasonable availability, lower communication cost as well as system load than those that do not require any logical organisation of replicas. We propose in this paper the A2DS protocol: a single protocol that, unlike the existing proposed protocols, can be adapted to any 2D structure. Its read operation is carried out on any replica of every level of the structure whereas write operations are performed on all replicas of a single level of the structure. We present several basic 2D structures and introduce the new idea of obtaining other 2D structures by the composition of several basic ones. Two structures are proposed that have near optimal performance in terms of the communication cost, availability and system load of their read and write operations. Also, we introduce a new protocol that provides better performance for its write operations than those of ROWA protocol while preserving similar read performance.
Cite as

Robert Basmadjian and Hermann de Meer. An Arbitrary 2D Structured Replica Control Protocol. In 17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011). Open Access Series in Informatics (OASIcs), Volume 17, pp. 157-168, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)

Copy BibTex To Clipboard

@InProceedings{basmadjian_et_al:OASIcs.KiVS.2011.157,
  author =	{Basmadjian, Robert and de Meer, Hermann},
  title =	{{An Arbitrary 2D Structured Replica Control Protocol}},
  booktitle =	{17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011)},
  pages =	{157--168},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-27-9},
  ISSN =	{2190-6807},
  year =	{2011},
  volume =	{17},
  editor =	{Luttenberger, Norbert and Peters, Hagen},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.KiVS.2011.157},
  URN =		{urn:nbn:de:0030-drops-29677},
  doi =		{10.4230/OASIcs.KiVS.2011.157},
  annote =	{Keywords: Replication, Performance attributes, Reliability, Availability, Load}
}
Document
DOI: 10.4230/DagSemProc.07461.15
Structured Markov Chains Arising from Finite-Source Retrial Queues with Orital Search

Authors: Patrick Wüchner, János Sztrik, and Hermann de Meer

Published in: Dagstuhl Seminar Proceedings, Volume 7461, Numerical Methods for Structured Markov Chains (2008)

Abstract
We consider retrial queueing systems with a finite number of homogeneous sources of calls, a single reliable server, and the search for orbiting customers by the server after job completion. During this investigation, the infinitesimal generator of the underlying (finite) continuous-time Markov chain takes a (level-dependent) QBD-like form. After solving for the steady state probabilities using the MOSEL-2 tool, the results show a surprising maximum of the mean response time. This maximum was already discovered by other researchers dealing with finite-source retrial queues. However, to our best knowledge, no thorough investigation was done yet why this maximum exists and in which way it depends on the system parameters. In the talk, after introducing the backgrounds of finite-source retrial queues with orbital search, a generalized stochastic Petri net is used to derive the underlying continuous-time Markov chain and its generator. Finally, using the seminar, we can hopefully bring forward discussions how to make more general statements on the parameter-dependent behavior of the response time’s maximum.
Cite as

Patrick Wüchner, János Sztrik, and Hermann de Meer. Structured Markov Chains Arising from Finite-Source Retrial Queues with Orital Search. In Numerical Methods for Structured Markov Chains. Dagstuhl Seminar Proceedings, Volume 7461, pp. 1-4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)

Copy BibTex To Clipboard

@InProceedings{wuchner_et_al:DagSemProc.07461.15,
  author =	{W\"{u}chner, Patrick and Sztrik, J\'{a}nos and de Meer, Hermann},
  title =	{{Structured Markov Chains Arising from Finite-Source Retrial Queues with Orital Search}},
  booktitle =	{Numerical Methods for Structured Markov Chains},
  pages =	{1--4},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2008},
  volume =	{7461},
  editor =	{Dario Bini and Beatrice Meini and Vaidyanathan Ramaswami and Marie-Ange Remiche and Peter Taylor},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07461.15},
  URN =		{urn:nbn:de:0030-drops-13895},
  doi =		{10.4230/DagSemProc.07461.15},
  annote =	{Keywords: Structured Markov chain, finite source, retrial queues, orbital search, performance measures, performance tool}
}
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact